This paper focuses on the numerical solutions of the effects of magnetic field, radiation, variable viscosity and heat generation on similarity solutions of mixed convection adjacent to an isothermal vertical plate which is embedded in a porous medium. A similarity transformation is used to reduce the partial differential equations governing the problem into ordinary differential equations and the equations are solved numerically subject to appropriate boundary conditions by the use of Runge-Kutta-Gill method together with a shooting technique. The flow and heat transfer quantities of similarity equations are found to be the functions of C,Rd, ,Q m g and RP where C is the magnetic interaction parameter, Rd is the radiation parameter, m g is viscosity variation coefficient, Q is the heat generation/absorption parameter and RP is the mixed convection parameter which is the ratio of Rayleigh to pe¢clet numbers. In the present work the cases of assisting and opposing flows are discussed. It has been found that in opposing flow case, dual solutions exist for negative values of RP and boundary layer separation occurs. It is observed that depending on the values of RP there exists no solution, a unique solution or dual solutions and also the temperature decreases significantly with increase in Q and C. Skin friction, heat transfer coefficient, velocity and temperature fields are studied and discussed with the help of a table and graphs.

This paper presents the design and practical implementation of inverse neural controller which is used to control the operation of six Degree Of Freedom (6DOF) robotic manipulator. An efficient off-line training method has been proposed which is used to train the neural network controller to be used as fed forward controller in the real time applications without need to the on-line training which is time consumption method. All the control algorithms and real time programming had been written with the aid of the MATLAB software.

These days, Blind Source Separation (BSS) techniques are the most common and beneficial method, in signal processing. In the field of multichannel recording, over the past years, many techniques of BSS are introduced which can work accurately, in contrast to the multichannel recording, in the single channel measurement, only a few methods are existed. One of the much popular algorithms of BSS is Independent Component Analysis (ICA) which applies to separate the independent components from multi channel measurements. In this paper, we proposed two new algorithms to separate the mixed sources in single channel recording. We named our methods: Automated EE-ICA and EE-ICA with post processing; these methods are based on composing the Empirical Mode Decomposition (EMD) and ICA in a new manner. EMD is a technique for splitting up the single channel signal into its components. We will investigate the performance of our methods in the field of biomedical signals.

In this work, we propose an algorithm to produce the double-base chain that optimizes the time used for computing an elliptic curve scalar multiplication, i.e. the bottleneck operation of the elliptic curve cryptosystem. The double-base number system and its subclass, double-base chain, are the representation that combines the binary and ternary representations. The time is measured as the weighted sum in terms of the point double, triple, and addition, as used in evaluating the performance of existing greedy-type algorithms, and our algorithm is the first to attain the minimum time by means of dynamic programming. Compared with greedy-type algorithm, the experiments show that our algorithm reduces the time for computing the scalar multiplication by 3.88-3.95% with almost the same average running time for the method itself. We also extend our idea, and propose an algorithm to optimize multi-scalar multiplication. By that extension, we can improve a computation time of the operation by 3.2-11.3%.

In a graph G, a vertex dominates itself and its neighbours. A subset S of V is called a dominating set in G if every vertex in V is dominated by at least one vertex in S. The domination number g (G) is the minimum cardinality of a dominating set. A set S ÍV is called a double dominating set of a graph G if every vertex in V is dominated by at least two vertices in S. The minimum cardinality of a double dominating set is called double domination number of G and is denoted by dd(G). The connectivity k (G) of a connected graph G is the minimum number of vertices whose removal results in a disconnected or trivial graph. In this paper we find an upper bound for the sum of the double domination number and connectivity of a graph and characterize the corresponding extremal graphs.

Vehicle-to-infrastructure (V2I) communication based on wireless local area network (WLAN) IEEE 802.11 standard technology can support user in-motion to achieve preferable Internet connectivity. Wireless access for the vehicular environment (i.e. IEEE802.11p) provides the required standardization for vehicle-to-vehicle V2X communication solutions supporting raw data rate up to 27 Mbps. This standard is created for urgent short message transmission. Otherwise, for transmission of large amount of data alternative solutions may be proposed. In this paper we present an experimental study of IEEE802.11g using off-the-shelf devices in vehicle-to-infrastructure small scale scenario. In order to evaluate the V2I the type of communication in large scale scenario, in this paper we propose analytic model to characterize the goodput of WLAN-based networks using Markov process

Caching at the mobile client is prospective technique that can reduce the number of uplink requests, lighten the server load .However, Variable data size, data updates ,limited client resource and frequent client disconnection make cache management a challenge .object caching is often used to improve the performance of mobile application .Consistency approach to maintaining cache consistency with the use of Invalidation (or) update reports. The server periodically broadcasts updates (or) invalidation report to clients .update report reflect the changes in the state database. A drawback of this method is that invalidation report impose a high processing load on clients .clients have to listen to all report ,even through there may be no changes in the data caching .With the aim of reducing the cache consistency maintenance work .I have proposed agent based mechanism to save wireless bandwidth ,reduce network traffic and reduce the workload in server .Based on the mechanism derived queuing model for the simulation .Moreover Ns2 simulation performance were analyze the result proposed technique over existing system

Fractal image compression provides immense advantages as compared to conventional image compressions. Though the fractal image encoding time is comparatively quite high as compared to the conventional ones but the decoding time is far less and almost instantaneous. Besides, fractal images are resolution-independent, implying that these images will render the same intensity and quality even when scaled. In other words the number of pixels remains unchanged even while extrapolating the image. In addition to it, the fractal image quality remains un-altered even at low-bit rates thus making it a suitable candidate for offline applications. The present baseline approach for fractal image compression is modified and supported with advanced parallel hardware in the form of Graphical Processor Units from Nvidia Corporation. The GPUs consist of many cores thus providing SIMD parallel processing capability at an un-imaginable rate of around 24 GFLOPS. This processing speed was not possible earlier before the advent of GPUs except in some selected highly evolved supercomputers. The rendering of image and its compression is implemented using OpenCL library. The benefits of faster fractal compression lie in the realm of medical imaging, satellite reconnaissance, gaming & film media.

Digital wireless communication has become one of the most exciting research topics in the electrical and electronic engineering field due to the explosive demands for high-speed wireless services, such as cellular video conferencing. Digital video broadcasting-terrestrial-second generation (DVB-T2) has been demonstrated to provide services with very high spectral efficiency and improved performance. Also, OFDM systems have been deployed in mobile networks for their spectral efficiency and optimum bit error rate. Among the OFDM systems, wavelet based systems have been demonstrated to have improved bandwidth and channel performance. In this paper the authors demonstrate that very high spectral efficiency, BER and PAPR can be achieved by employing DWT-DAPSK scheme with the DVTB-T2 system. It is demonstrated in this paper that including companding with this system results in further reduction of PAPR.

In this paper, two route discovery methods based on received power of repeater nodes for sensor networks are studied. The first proposed method is a simple one and the second proposed method is in multipath fading environments. In both methods, the received power information in Physical Layer of repeater nodes is added to Route Request Message, and the message is transferred from a source node to a destination node via repeater nodes. When each repeater node received Route Request Message, the message is decided whether accept or not by referring to received power information in Physical Layer. In the destination node, the most optimal route is selected from plural candidates according to the following criteria: received power level, number of hops and sequence number. From the results of computer simulations, it has been clarified that the first proposed method has advantages in the route effective time, data distribution ratio and throughput comparing with the conventional method even if the route discovery time is lengthened by about 0.5 seconds. Also it has been clarified that the second proposed method in multipath fading environments has advantages in the route effective time and data distribution ratio comparing with the conventional method even if the route discovery time is lengthened by about 3 seconds.

This paper reinforced security under the network evaluation of wire/wireless integration of NEMO (NEwork MObility) supporting mobility and network-based PMIPv6 (Proxy Mobile IPv6). It also proposes SK-L2AM (Symmetric Key-Based Local-Lighted Authentication Mechanism) based on simple key which reduces code calculation and authentication delay costs. Moreover, fast handoff technique was also adopted to reduce handoff delay time in PMIPv6 and X-FPMIPv6 (eXtension of Fast Handoff for PMIPv6) was used to support global mobility. In addition, AX-FPMIPv6 (Authentication eXtension of Fast Handoff for PMIPv6) is proposed which integrated SK-L2AM and X-FPMIPv6 by applying Piggybacks method to reduce the overhead of authentication and signaling. The AX-FPMIPv6 technique suggested in this paper shows that this technique is better than the existing schemes in authentication and handoff delay according to the performance analysis.

This paper presents a new behavior of autonomous moving multi-agents, whose agents stochastically move over a resource consisting of cells in accordance with transition probabilities, depending on other agents. We suppose interactions or coordination among agents such that an agent can not move to a destination cell occupied by agents more than the agents of a current cell. The first we show that a moving multiagent with an appropriate average moving speed is more stable than a moving multi-agent without average moving speed. Then the stability can be accelerated by giving appropriate moving speed for agents. The second result is that the resource utilization of a moving multi-agent with an appropriate average moving speed becomes higher than the resource utilization of a moving multiagent without average moving speed. Then the resource utilization can be accelerated by giving moving speed. The above results are based on both theory and experiments, and we present the optimal moving speed of the system-specific for the acceleration.

Business process reengineering (BPR) is not just the program of business process improvement, but it improves the operations of the business process as a whole. Workflow Reengineering Methodology (WRM) is comprehensive, covering the process improvement effort from the identification of a need for change to the final implementation and maintenance of the improved workflow. Our research has proposed an enhanced methodology of WRM to suit small and medium enterprise (SME). A conceptual model of BPR for SMEs has been proposed and applied in a case study collaborated with a cargo company di Malaysia. The architecture of the integrated system was designed to proof the practicality of the model specifically for SMEs environment. In this case study, the priorities of the company were the improvement in administration, customer services and operations divisions. Improvement of the operation in these three divisions was implemented by introducing a computerized system that focuses on the improvements in the effectiveness of the speed of processing time, cost efficiency and human resources as well as an increase in level of customer service. The case study shows the proposed enhanced WRM is appropriate and practical for SMEs.

The distributed recursive wave is a programming model based on distributed procedure call, allowing distributed algorithm definition using central algorithm. For returning result to calling process, a feedback function is used. Introducing feedback function makes the DRW more complex, but it allows more control on the execution of the DRW depending on the application needs. With this solution, DRW can be applicable for collecting, not only for propaganda of information. This DRW with feedback function is applied in the case of network convergecast problem. Convergecast is one of group communication tasks in distributed systems: convergecast, broadcast, multicast and unicast. ConvergeCast algorithms allow concentrating network information for calculating of global parameters. When the Converge Cast is required, information about the network itself such as routing table, network topology is not available. Distributed recursive wave is a way to construct algorithms that can be customized only by local parameters and functions. Distributed recursive wave then is suitable for distributed systems having network information dynamically changing without global information. Convergecast can be raw information collection or aggregation, so the feedback function DRW is suitable to apply to adapt both cases. This article presents a new converge cast algorithm. This algorithm is experimentally implemented using Shell Script.

In this work the propagation of radio waves at 2.4 GHz in NLOS conditions has been studied. The study was carried out using two transmitters operating on different standards: 802.11g (D-Link) and 802.11n (TrendNet). The experiments were carried out under different scenarios in order to investigate the effect of the walls on signal propagation. Experimental results were processed using statistical methods and were compared with "log-distance" and free space models and with the network simulation programme "Aerohive online planner" results. A new signal prediction model, which allows predicting signal propagation depending on the number of walls, was created. In this work 802.11g and 802.11n standards were also compared. The results can be used to further investigate radio wave propagation in indoor NLOS conditions and in the development of wave propagation models.